4 found
Order:
  1. Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
  2.  23
    A century of controversy over the foundations of mathematics.Gregory J. Chaitin - 2000 - Complexity 5 (5):12-21.
  3.  40
    Goedel's Way: Exploits Into an Undecidable World.Gregory J. Chaitin - 2011 - Crc Press. Edited by Francisco Antônio Doria & Newton C. A. da Costa.
    This accessible book gives a new, detailed and elementary explanation of the Gödel incompleteness theorems and presents the Chaitin results and their relation to the da Costa-Doria results, which are given in full, but with no ...
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  28
    How to run algorithmic information theory on a computer:Studying the limits of mathematical reasoning.Gregory J. Chaitin - 1996 - Complexity 2 (1):15-21.